- Title
- Parameterized approximation algorithms for HITTING SET
- Creator
- Brankovic, Ljiljana; Fernau, Henning
- Relation
- WAOA 2011: 9th International Workshop on Approximation and Online Algorithms. Proceedings of the 9th International Workshop on Approximation and Online Algorithms (WAOA 2011) (Saarbrücken, Germany 8-9 September, 2011) p. 63-76
- Publisher Link
- http://dx.doi.org/10.1007/978-3-642-29116-6_6
- Publisher
- Springer
- Resource Type
- conference paper
- Date
- 2012
- Description
- We are going to analyze simple search tree algorithms for approximating d -Hitting Set, focussing on the case of factor-2 approximations for d = 3. We also derive several results for hypergraph instances of bounded degree, including a new polynomial-time approximation.
- Subject
- algorithms; polynomial-time approximation
- Identifier
- http://hdl.handle.net/1959.13/1058017
- Identifier
- uon:16311
- Identifier
- ISBN:9783642291159
- Language
- eng
- Reviewed
- Hits: 548
- Visitors: 546
- Downloads: 1
| Thumbnail | File | Description | Size | Format |
|---|